merge sort
英 [mɜːdʒ sɔːt]
美 [mɜːrdʒ sɔːrt]
合并分类
双语例句
- One notable thing regarding merge scan join is that the optimizer would aggressively avoid SORT by keeping track of the "order property" of the data.
一件值得有关合并扫描联接注意的事情是通过保持跟踪数据的“顺序属性”，优化器将积极避免SORT。 - A hash join is usually faster than a sort merge join since there is no sort operation involved.
哈希连接通常比分类合并连接快，因为它没有涉及到分类操作。 - If the query includes a join, the optimizer must determine the join plan ( hash, sort merge, or nested loop), and the order in which tables are evaluated or joined.
如果该查询包含了连接，那么优化器就必须确定连接计划（hash、sortmerge或nestedloop），以及评估或连接表的次序。 - With smoke and mirrors and a bit of match/ merge logic, DB2 can use multiple partitions of a DPSI for sort avoidance.
由于假象和一些匹配/合并逻辑，DB2可以使用一个DPSI的多个分区来规避排序。 - Well, we saw the teaser in terms of that animation that suggests this merge sort algorithm when implemented by a computer is absolutely faster.
我们从前面的动画中可以看到，这个归并排序算法在计算机上实现之后，绝对比其他算法更快。 - Merge sort takes this idea of divide and conquer, and it does the following: it says let's divide the list in half.
归并排序以如下的步骤使用了分治思想：，把列表分成两半：，下面就是分治。 - In the mail merge recipients dialog box, click the column heading of the item you want to sort by.
在“邮件合并收件人”对话框中，单击要作为排序依据的项的列标题。 - Let's do selection and let's do merge sort here on the right just to see what actually happens.
中间进行选择排序，右边进行归并排序，看看会发生什么。 - Comparing with other sorting algorithms, the2-way merge algorithm is the best one to sort two sorted sublists.
和其它排序算法相比，二路归并最适合于两个有序子表的排序。 - OK, what I would like you to see is I've been printing out, as I went along, actually let's back up slightly and look at the code. There's merge sort.
好的，我想让你们看就是我运行过后，打印出来的结果，我们再回头看一下这段代码，这就是归并排序，输入一个列表。 - If you attempt to create the joins out of order, the merge join Transformation Editor prompts you to create additional joins for the skipped sort order positions.
如果尝试不按顺序创建联接，“合并联接转换编辑器”会提示您为跳过的排序顺序位置创建其他联接。 - Let's run merge sort on it, and then we'll look at the code.
让我们在这个列表上运行归并排序，然后我们在看一下代码。 - An Optimization of a Fast Merge Sort Algorithm
快速合并分类算法的优化 - Algorithm complexity of two& way polyphase merge external sort
二路多步归并外分类的算法复杂度 - The Algorithm of Bitonic Merge-Sort
二分归并排序算法 - The Catenulate Realization Mode of Two-way Merge Sort
二路归并排序的链式实现方式 - A study on 2-way merge sort
二路归并排序的研究 - We also give the key algorithms included in the search engine: the word split algorithm, the merge sort algorithm and the large file processing technology.
给出搜索引擎中包含的关键技术算法：分词技术、多路归并算法和大文件处理技术； - This paper describes an improved fast merge sort algorithm and its implementation on a microcomputer.
本文介绍一种改进的快速合并分类算法及其在微机上的实现。 - A method of sorting particles based on the parallel sorting algorithm "odd-even merge sort" has been proposed.
提出了一种使用“奇-偶合并排序”来进行高效的粒子距离排序的方法。 - In various of sort algorithms based on comparative operations, the well-known merge sort algorithm is the fastest but at the expense of more extra memory space.
在用各种比较操作进行分类的算法中，著名的合并分类（MergeSort）法的分类速度最快，但它要以较大的额外存贮空间为代价。 - Assuming each query term mutually independent, merge all query terms scores based on the principle of multiplication, finally evaluate expert on the query comprehensively, and return the experts sort list.
假设每个查询词相互独立，根据乘法原理合并所有查询词得分，得到对专家在整个查询中的综合评价，然后按序返回专家列表。